If the [T, Id] automorphism is Bernoulli then the [T, Id] endomorphism is standard
نویسندگان
چکیده
منابع مشابه
If the [ T , Id ] automorphism is Bernoulli then the [ T , Id ] endomorphism is standard
For any 1-1 measure preserving map T of a probability space we can form the [T, Id] and [T, T−1] automorphisms as well as the corresponding endomorphisms and decreasing sequence of σ-algebras. In this paper we show that if T has zero entropy and the [T, Id] automorphism is isomorphic to a Bernoulli shift then the decreasing sequence of σ-algebras generated by the [T, Id] endomorphism is standar...
متن کاملA Zero Entropy T Such That the [t ,id] Endomorphism Is Nonstandard
We present an example of an ergodic transformation T , a variant of a zero entropy non loosely Bernoulli map of Feldman [1], such that the sequence of random variables generated by the [T ,Id] endomorphism is nonstandard.
متن کاملA dyadic endomorphism which is Bernoulli but not standard
Any measure preserving endomorphism generates both a decreasing sequence of σ-algebras and an invertible extension. In this paper we exhibit a dyadic measure preserving endomorphism (X, T, μ) such that the decreasing sequence of σ-algebras that it generates is not isomorphic to the standard decreasing sequence of σ-algebras. However the invertible extension is isomorphic to the Bernoulli two sh...
متن کاملAn Endomorphism Whose Square Is Bernoulli
One of the corollaries of Ornstein’s isomorphism theorem is that if (Y, S, ν) is an invertible measure preserving transformation and (Y, S, ν) is isomorphic to a Bernoulli shift then (Y, S, ν) is isomorphic to a Bernoulli shift. In this paper we show that noninvertible transformations do not share this property. We do this by exhibiting a uniformly 2-1 endomorphism (X, σ, μ) which is not isomor...
متن کاملOn graphs admitting t-ID codes
Let G = (V,E) be a graph and N [X] denote the closed neighbourhood of X ⊆ V , that is to say, the union of X with the set of vertices which are adjacent to X. Given an integer t ≥ 1, a subset of vertices C ⊆ V is said to be a code identifying sets of at most t vertices of G—or, for short, a t-set-ID code of G—if the sets N [X] ∩ C are all distinct, when X runs through subsets of at most t verti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2003
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm155-3-1